Complexity theory - PDFSEARCH.IO - Document Search Engine

Complexity theory
Results: 3600

#	Item
301	What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1 2 Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:56:55 Complexity classes NP-hardness NP P versus NP problem Computational complexity theory P Reduction
302	NP-complete Problems and Physical Reality arXiv:quant-ph/0502072v2 21 Feb 2005 Scott Aaronson∗ Add to Reading List Source URL: cqi.inf.usi.ch Language: English - Date: 2012-02-22 09:04:08 Computational complexity theory Complexity classes Quantum computing Theoretical computer science Mathematical optimization Quantum algorithm NP P versus NP problem BQP PP Low Time complexity
303	The Influence of Wireless Modalities on Complexity Theory Ike Antkaretoo International Institute of Technology United Slates of Earth Add to Reading List Source URL: membres-lig.imag.fr Language: English - Date: 2014-01-09 04:24:29 Actor model Concurrent computing
304	Fast modular composition in any characteristic Kiran S. Kedlaya∗ MIT Christopher Umans† Caltech Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2008-08-04 00:47:22 Computer algebra Computational complexity theory Polynomials Algebra Factorization of polynomials Polynomial Time complexity Reduction Polynomial greatest common divisor Factorization of polynomials over finite fields
305	Modes and Cuts in Metabolic Networks: Complexity and Algorithms∗ Vicente Acu˜ na2,3 , Flavio Chierichetti1 , Vincent Lacroix2,3,6 , Alberto Marchetti-Spaccamela1 , Marie-France Sagot2,3 , Leen Stougie4,5 Add to Reading List Source URL: pbil.univ-lyon1.fr Language: English - Date: 2008-10-22 02:35:19 Complexity classes Flux balance analysis NP Matrix Matching Hamiltonian path problem Sharp-P-complete Hypergraph Computational complexity theory Stoichiometry P Bipartite graph
306	Applied Mathematics and Computation xxxxxx–xxx Contents lists available at ScienceDirect Applied Mathematics and Computation journal homepage: www.elsevier.com/locate/amc Add to Reading List Source URL: scribblethink.org Language: English - Date: 2012-10-07 04:35:37 Computability theory Theory of computation Randomness Theoretical computer science Algorithmic information theory Kolmogorov complexity Algorithmically random sequence Computable function Complexity Algorithm Pseudorandomness Lossless compression
307	Graph Isomorphism is in SPP V. Arvind and Piyush P Kurur Institute of Mathematical Sciences, C.I.T Campus Chennai, India email: {arvind,ppk}@imsc.ernet.in Abstract Add to Reading List Source URL: www.cse.iitk.ac.in Language: English - Date: 2016-07-30 09:35:21 Complexity classes Finite groups Combinatorial group theory Graph isomorphism problem Morphisms Hidden subgroup problem Permutation group Permutation Graph canonization ArthurMerlin protocol Graph automorphism NP
308	International debt collection Outlook A three-step road to complexity: Payment practices, legal action and insolvency proceedings Add to Reading List Source URL: www.eulerhermes.com Language: English - Date: 2016-07-25 12:13:35 Complex systems theory Euler Hermes Insolvency Complexity Euler
309	Powerpoint-presentation Information and Computing Sciences Add to Reading List Source URL: www.usefulpatterns.org Language: English - Date: 2015-04-25 08:23:03 Algorithmic information theory Computability theory Randomness Theoretical computer science Turing machine Kolmogorov complexity Algorithmically random sequence Algorithmic probability Minimum description length Complexity Ray Solomonoff Algorithm
310	Limitations of Quantum Advice and One-Way Communication Add to Reading List Source URL: theoryofcomputing.org Language: English - Date: 2014-11-14 13:01:57 Quantum complexity theory Quantum information science Quantum computing Computational complexity theory Theoretical computer science PP BQP QMA Quantum algorithm Quantum circuit IP Quantum information

UPDATE